Adding and subtracting eigenspaces with eigenvalue decomposition and singular value decomposition

نویسندگان

  • Peter M. Hall
  • A. David Marshall
  • Ralph R. Martin
چکیده

This paper provides algorithms for adding and subtracting eigenspaces, thus allowing for incremental updating and downdating of data models. Importantly, and unlike previous work, we keep an accurate track of the mean of the data, which allows our methods to be used in classification applications. The result of adding eigenspaces, each made from a set of data, is an approximation to that which would obtain were the sets of data taken together. Subtracting eigenspaces yields a result approximating that which would obtain were a subset of data used. Using our algorithms, it is possible to perform ‘arithmetic’ on eigenspaces without reference to the original data. Eigenspaces can be constructed using either eigenvalue decomposition (EVD) or singular value decomposition (SVD). We provide addition operators for both methods, but subtraction for EVD only, arguing there is no closed-form solution for SVD. The methods and discussion surrounding SVD provide the principle novelty in this paper. We illustrate the use of our algorithms in three generic applications, including the dynamic construction of Gaussian mixture models. q 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On adding and subtracting eigenspaces with EVD and SVD

This paper provides two algorithms: one for adding eigenspaces, another for subtracting them, thus allowing for incremental updating and downdating of data models. Importantly, and unlike previous work, we keep an accurate track of the mean of the data, which allows our methods to be used in classification applications. The result of adding eigenspaces, each made from a set of data, is an appro...

متن کامل

ELLA: An Efficient Lifelong Learning Algorithm - Online Appendix

where we use tick marks to denote the updated versions of D(t) and s(t) after receiving the new training data, and D(t) 1 2 is the matrix square-root of D(t). The updates to A consist of adding or subtracting an outer-product of a matrix of size (d × k)-by-d, which implies that each update has rank at most d. If we have already computed the eigenvalue decomposition of the old A, we can compute ...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

Modified Laplace Decomposition Method for Singular IVPs in the second-Order Ordinary Differential Equations

  In this paper, we use modified Laplace decomposition method to solving initial value problems (IVP) of the second order ordinary differential equations. Theproposed method can be applied to linear and nonlinearproblems    

متن کامل

A Dimensionless Parameter Approach based on Singular Value Decomposition and Evolutionary Algorithm for Prediction of Carbamazepine Particles Size

The particle size control of drug is one of the most important factors affecting the efficiency of the nano-drug production in confined liquid impinging jets. In the present research, for this investigation the confined liquid impinging jet was used to produce nanoparticles of Carbamazepine. The effects of several parameters such as concentration, solution and anti-solvent flow rate and solvent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Image Vision Comput.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2002